The game of Overprescribed Cops and Robbers played on graphs
نویسندگان
چکیده
We consider the effect on the length of the game of Cops and Robbers when more cops are added to the game play. In Overprescribed Cops and Robbers, as more cops are added, the capture time (the minimum length of the game assuming optimal play) monotonically decreases. We give the full range of capture times for any number of cops on trees, and classify the capture time for an asymptotic number of cops on grids, hypercubes, and binomial random graphs. The capture time of planar graphs with a number of cops at and far above the cop number is considered.
منابع مشابه
Lazy Cops and Robbers Played on Random Graphs and Graphs on Surfaces
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. The lazy cop number is the analogue of the usual cop number for this game. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the analogue of the cop number of the hypercube. By investigating expansi...
متن کاملA game of cops and robbers played on products of graphs
The game of cops and robbers is played with a set of 'cops' and a 'robber' who occupy some vertices of a graph. Both sides have perfect information and they move alternately to adjacent vertices. The robber is captured if at least one of the cops occupies the same vertex as the robber. The problem is to determine on a given graph, G, the least number of cops sufficient to capture the robber, ca...
متن کاملThe Cop Number of the One-Cop-Moves Game on Planar Graphs
Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph’s edges with perfect information about each other’s positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aig...
متن کاملCops and Robbers on diameter two graphs
In this short paper we study the game of Cops and Robbers, played on the vertices of some fixed graph G of order n. The minimum number of cops required to capture a robber is called the cop number of G. We show that the cop number of graphs of diameter 2 is at most √ 2n, improving a recent result of Lu and Peng by a constant factor. We conjecture that this bound is still not optimal, and obtain...
متن کاملCatch Me If You Can: Cops and Robbers on Graphs
Vertex pursuit games are widely studied by both graph theorists and computer scientists. Cops and Robbers is a vertex pursuit game played on a graph, where some set of agents (or Cops) attempts to capture a robber. The cop number is the minimum number of cops needed to win. While cop number of a graph has been studied for over 25 years, it is not well understood, and has few connections with ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 33 شماره
صفحات -
تاریخ انتشار 2017